Derivation of Systolic Programs
نویسندگان
چکیده
We describe a methodology for mapping linear recurrence equations to a spectrum of systolic architectures. First, we design a systolic program in a very general architecture referred to as Basic Systolic Architecture and establish the correctness of the implementation. Next, we show how ef-cient transformations/implementations of programs for diierent systolic architectures can be obtained through transformations such as projections and translations.
منابع مشابه
Deriving a systolic regular language recognizer
We present a derivation of a regular language recognizing circuit originally developed by Foster and Kung [4]. We make use of pointfree relation algebra, in a style combining elements from earlier work in the Eindhoven Mathematics of Program Construction group [0], and from Ruby [6]. First we derive non-systolic recognizers, much in the same way as functional programs are derived. Then we make ...
متن کاملApplication of the N-point moving average method for brachial pressure waveform-derived estimation of central aortic systolic pressure.
The N-point moving average (NPMA) is a mathematical low-pass filter that can smooth peaked noninvasively acquired radial pressure waveforms to estimate central aortic systolic pressure using a common denominator of N/4 (where N=the acquisition sampling frequency). The present study investigated whether the NPMA method can be applied to brachial pressure waveforms. In the derivation group, simul...
متن کاملOn the formal derivation of a systolic array for recursive least squares estimation
A formal proof is presented for a recently presented systolic array for recursive least squares estimation by inverse updates. The derivation of this systolic array is highly non-trivial due to the presence of data contra-flow and feedback loops in the underlying signal flow graph. This would normally prohibit pipelined processing. However, it is shown that suitable delays may be introduced int...
متن کاملAn Optimal Algo-Tech-Cuit for the Knapsack Problem
We present a formal derivation and proof of correctness of a systolic array for the knapsack problem, a well known, NP-complete problem. The dependency graph of the algorithm is not completely known statically, so the derivation also serves as a case study for systolic synthesis for this class of programs. The array is itself important since it achieves optimal performance on a model much weake...
متن کاملVerifying Partial Correctness of Logic Programs with Delay Declarations
In this paper we propose a method for verifying partial correctness of logic programs with delay declarations. The method is based on the notion of specialised derivation. It diiers from the deenition of SLD-derivation since more instantiated general uniiers are computed instead of standard mgus. The contribution of this paper follows from the observation that the derivations of logic programs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994